Locating, replacing, and deleting patterns in graphics editing of line drawings

نویسندگان

  • Daniel Thalmann
  • Louis-Philippe Demers
  • Nadia Magnenat-Thalmann
چکیده

The operations of locating, deleting, or replacing patterns in a given line drawing are very important in graphics editing. However, they are generally not yet implemented in generalpurpose graphics editors. Algorithms to implement these operations have been designed in an efficient way and have been introduced into the GRAFEDIT general-purpose graphics editor. This paper presents different aspects of the three operations, describes the procedures that have been implemented, and discusses the algorithm and data structures chosen. The incorporation of the operations into the graphics editor is discussed and a few examples are also presented.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Genetic Algorithm based Optimization Method in 3D Solid Reconstruction from 2D Multi-View Engineering Drawings

There are mainly two categories for a 3D reconstruction from 2D drawings: B-Rep and CSG that both these methods have serious weaknesses despite being useful. B-Rep method which has been older and have wider function range is problematic because of high volume of calculations and vagueness in answers and CSG method has problem in terms of very limited range of volumes and drawings that it can an...

متن کامل

Emphasising in Line drawings

When looking at scienti c publications or text books one can nd a lot of images used to explain facts and connections to impart knowledge or information We refer to these pictures like Leister in as illustrations A great variety of pictures are being used as illustrations photographs photorealistic computer graphics line drawings diagrams In many of these illustrations special methods and techn...

متن کامل

Tree-Partitions of k-Trees with Applications in Graph Layout

A tree-partition of a graph is a partition of its vertices into ‘bags’ such that contracting each bag into a single vertex gives a forest (after deleting loops and replacing parallel edges by a single edge). It is proved that every k-tree has a tree-partition such that each bag induces a (k 1)-tree, amongst other properties. Applications of this result to two well-studied models of graph layout...

متن کامل

A System for Interpretation of Line Drawings

A system for interpretation of images of paper-based line drawings is described. Since a typical drawing contains both test strings and graphics, an algorithm has been developed to locate and separate text strings of various font size, style, and orientation. This is accomplished by applying the Hough transform to the centroids of connected components in the image. The graphics in the segmented...

متن کامل

Cost Evaluation of Interactively Correcting Recognized Engineering Drawings

We present a new scheme, which is based on the cost of interactively correcting detection errors, for performance evaluation of engineering drawings recognition algorithms. We correct an actual output graphic objects so that they to the expected output in a graphics editing tool using GUI, like Autocad. Through experiments, We define the time spent on the editing operations as the output elemen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computer Vision, Graphics, and Image Processing

دوره 29  شماره 

صفحات  -

تاریخ انتشار 1985